A Point Cloud Simplification Algorithm for Mechanical Part Inspection

نویسندگان

  • Hao Song
  • Hsi-Yung Feng
چکیده

A point cloud data set, a set of massive and dense coordinate data points sampled from the surface of a physical object, is emerging as a new representation format of 3D shapes. This is mostly attributed to recent advances in the range finding technology of high-speed 3D laser scanning. A typical laser scanned data set often contains millions of data points and this leads to significant computational challenges in processing the point cloud data for practical applications such as the high-speed laser inspection of mechanical parts. To reduce the number of the massive data points to facilitate geometric computation, this paper presents a simplification algorithm for the laser scanned point cloud data from manufactured mechanical parts, whose boundary surfaces include sharp edges. Due to the distinct feature represented by the points located on or near the sharp edges, these points are first identified and retained. The algorithm then repeatedly removes the least important point from the remaining data points until the specified data reduction ratio is reached. Quantification of a point’s importance is based on points in its neighborhood and it indicates the point’s contribution to the representation of the local surface geometry. The effectiveness of the proposed algorithm is shown through the simplification results of two practical point cloud data sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new point cloud simplification algorithm

We present a new technique for the simplification of pointsampled geometry without any prior surface reconstruction. Using Fast Marching farthest point sampling for implicit surfaces and point clouds [1], we devise a coarse-tofine uniform or feature-sensitive simplification algorithm with user-controlled density guarantee. The algorithm is computationally and memory efficient, easy to implement...

متن کامل

Intrinsic point cloud simplification

Modelling and visualisation methods working directly with point-sampled geometry have developed into attractive alternatives to more traditional mesh-based surface processing. In this paper, we consider a vital step in any point-based surface processing pipeline, point cloud simplification. Building upon the intrinsic point cloud simplification idea put forward in [14], we obtain a simplificati...

متن کامل

Error-Controllable Simplification of Point Cloud

Point cloud simplification has become a vital step in any point-based surface processing pipeline. This paper describes a fast and effective algorithm for point cloud simplification with feature preservation. First, feature points are extracted by thresholding curvatures; Second, for non-feature points, they are covered by distinct balls, the points in each ball are substituted by an optimized ...

متن کامل

Comprehensive Analysis of Dense Point Cloud Filtering Algorithm for Eliminating Non-Ground Features

Point cloud and LiDAR Filtering is removing non-ground features from digital surface model (DSM) and reaching the bare earth and DTM extraction. Various methods have been proposed by different researchers to distinguish between ground and non- ground in points cloud and LiDAR data. Most fully automated methods have a common disadvantage, and they are only effective for a particular type of surf...

متن کامل

Point Cloud Data Simplification Using Movable Mesh Generation

In order to realize massive point cloud data simplification, a new movable mesh generation algorithm was proposed. Firstly, point cloud model was divided into a number of spatial grids. Secondly, the mesh generation was made like the first step again but more finely and with respecting of the distance threshold, and then, each appropriate point of the grids generated by the second step was filt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006